Generating Irreducible Triangulations of Surfaces

نویسنده

  • THOM SULANKE
چکیده

Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S0, S1, N1,and N2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other surfaces. This algorithm has been implemented as a computer program which terminates for S1, S2, N1, N2, N3, and N4. Thus the complete sets irreducible triangulations are now also known for S2, N3, and N4, with respective cardinalities 396784, 9708, and 6297982.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for Computing Irreducible Triangulations of Closed Surfaces in E and Its Application to the TriQuad Problem

Let S be a compact surface with empty boundary. A classical result from the 1920s by Tibor Radó asserts that every compact surface with empty boundary (usually called a closed surface) admits a triangulation [1]. Let e be any edge of a triangulation T of S . The contraction of e in T consists of contracting e to a single vertex and collapsing each of the two triangles meeting e into a single ed...

متن کامل

Irreducible Triangulations of Low Genus Surfaces

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of these irreducible triangulations.

متن کامل

2 8 M ar 2 01 1 Irreducible Triangulations of Surfaces with Boundary ∗

A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly nonorientable) surface of genus g ≥ 0 with b ≥ 0 boundaries is O(g + b). So far, the result was known only f...

متن کامل

Irreducible triangulations of surfaces with boundary

A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g ≥ 0 with b ≥ 0 boundary components is O(g + b). So far, the result was kn...

متن کامل

Generating triangulations on closed surfaces with minimum degree at least 4

We show that every triangulation on a closed surface, except the sphere, with minimum degree at least 4 can be obtained from an irreducible triangulation by two kinds of local deformations, called 4-splitting and addition of an octahedron and that every triangulation on the sphere can be obtained from the octahedron by them. c © 2002 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006